A spectral radius estimate and Entropy of Hypercubes
نویسندگان
چکیده
We consider a problem in Mathematical Biology that leads to a question in Graph Theory, which can be solved using an old but not widely known upper estimate of the spectral radius of a nonnegative matrix. We provide a new proof of this estimate.
منابع مشابه
Joint and Generalized Spectral Radius of Upper Triangular Matrices with Entries in a Unital Banach Algebra
In this paper, we discuss some properties of joint spectral {radius(jsr)} and generalized spectral radius(gsr) for a finite set of upper triangular matrices with entries in a Banach algebra and represent relation between geometric and joint/generalized spectral radius. Some of these are in scalar matrices, but some are different. For example for a bounded set of scalar matrices,$Sigma$, $r_*...
متن کاملLinear Maps Preserving Invertibility or Spectral Radius on Some $C^{*}$-algebras
Let $A$ be a unital $C^{*}$-algebra which has a faithful state. If $varphi:Arightarrow A$ is a unital linear map which is bijective and invertibility preserving or surjective and spectral radius preserving, then $varphi$ is a Jordan isomorphism. Also, we discuss other types of linear preserver maps on $A$.
متن کاملThe Sign-Real Spectral Radius for Real Tensors
In this paper a new quantity for real tensors, the sign-real spectral radius, is defined and investigated. Various characterizations, bounds and some properties are derived. In certain aspects our quantity shows similar behavior to the spectral radius of a nonnegative tensor. In fact, we generalize the Perron Frobenius theorem for nonnegative tensors to the class of real tensors.
متن کاملTaylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کاملOn spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- I. J. Bifurcation and Chaos
دوره 22 شماره
صفحات -
تاریخ انتشار 2012